Least singular value and condition number of a square random matrix with i.i.d. rows

نویسندگان

چکیده

Introducing a new method for studying general probability distributions on Rn, we generalize some results about the least singular value and condition number of random matrices with i.i.d. Gaussian entries to whole class rows.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

THE LEAST SINGULAR VALUE OF A RANDOM SQUARE MATRIX IS O(n) MARK RUDELSON AND ROMAN VERSHYNIN

Let A be a matrix whose entries are real i.i.d. centered random variables with unit variance and suitable moment assumptions. Then the smallest singular value sn(A) is of order n −1/2 with high probability. The lower estimate of this type was proved recently by the authors; in this note we establish the matching upper estimate.

متن کامل

Smooth Analysis of the Condition Number and the Least Singular Value

Let x be a complex random variable with mean zero and bounded variance. Let Nn be the random matrix of size n whose entries are iid copies of x and let M be a fixed matrix of the same size. The goal of this paper is to give a general estimate for the condition number and least singular value of the matrix M +Nn, generalizing an earlier result of Spielman and Teng for the case when x is gaussian...

متن کامل

Some remarks on the condition number of a real random square matrix

In this paper we obtain some bounds for the expectation of the logarithm of the condition number of a random matrix whose elements are independent and identically distributed random variables. We also include some examples and extensions to cover the smoothed analysis as well higher order moments.

متن کامل

On the least singular value of random symmetric matrices

Let Fn be an n by n symmetric matrix whose entries are bounded by n γ for some γ > 0. Consider a randomly perturbed matrix Mn = Fn +Xn, where Xn is a random symmetric matrix whose upper diagonal entries xij , 1 ≤ i ≤ j, are iid copies of a random variable ξ. Under a very general assumption on ξ, we show that for any B > 0 there exists A > 0 such that P(σn(Mn) ≤ n−A) ≤ n−B .

متن کامل

The Smallest Singular Value of a Random Rectangular Matrix

We prove an optimal estimate on the smallest singular value of a random subgaussian matrix, valid for all fixed dimensions. For an N × n matrix A with independent and identically distributed subgaussian entries, the smallest singular value of A is at least of the order √ N − √ n − 1 with high probability. A sharp estimate on the probability is also obtained.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistics & Probability Letters

سال: 2021

ISSN: ['1879-2103', '0167-7152']

DOI: https://doi.org/10.1016/j.spl.2021.109070